GWIS - model-free, fast and exhaustive search for epistatic interactions in case-control GWAS
نویسندگان
چکیده
منابع مشابه
GPU-accelerated exhaustive search for third-order epistatic interactions in case-control studies
Interest in discovering combinations of genetic markers from case-control studies, such as Genome Wide Association Studies (GWAS), that are strongly associated to diseases has increased in recent years. Detecting epistasis, i.e. interactions among k markers (k ≥ 2), is an important but time consuming operation since statistical computations have to be performed for each k-tuple of measured mark...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولFast Exhaustive Search for Polynomial Systems
We analyze how fast we can solve general systems of multivariate equations of various low degrees over F2; this constitutes a generic attack on a hard problem both important in itself and often arising as part of algebraic cryptanalysis. We do not propose new generic techniques, but instead we revisit the standard exhaustive-search approach. We show that it can be made more efficient both asymp...
متن کاملA General Model for Multilocus Epistatic Interactions in Case-Control Studies
BACKGROUND Epistasis, i.e., the interaction of alleles at different loci, is thought to play a central role in the formation and progression of complex diseases. The complexity of disease expression should arise from a complex network of epistatic interactions involving multiple genes. METHODOLOGY We develop a general model for testing high-order epistatic interactions for a complex disease i...
متن کاملFast Exhaustive Search for Quadratic Systems in F2 on FPGAs
In 2010, Bouillaguet et al. proposed an efficient solver for polynomial systems over F2 that trades memory for speed [BCC+10]. As a result, 48 quadratic equations in 48 variables can be solved on a graphics processing unit (GPU) in 21 minutes. The research question that we would like to answer in this paper is how specifically designed hardware performs on this task. We approach the answer by s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Genomics
سال: 2013
ISSN: 1471-2164
DOI: 10.1186/1471-2164-14-s3-s10